Improved View Selection Algorithm Using SOM and 0/1 Knapsack
نویسندگان
چکیده
منابع مشابه
Improved Clonal Selection Algorithm for Knapsack Problem
Clonal selection theory is one of the important theories in immunological area. Applying clonal selection to optimization problems can also be found in many papers. In this paper, the classical Clonal Selection Algorithm (CSA) is extended by introducing the receptor editing mechanism which provides a chance for autoreactive cells to survive during affinity maturation process. To demonstrate the...
متن کاملAn Improved Algorithm for Materialized View Selection
The data warehouse is subject oriented, integrated, nonvolatile and time-varying data sets, which is used to support management decision-making. A data warehouse stores materialized views of data from one or more sources, with the purpose of efficiently implementing Decision-support or OLAP queries. One of the most important decisions in designing a data warehouse is the selection of materializ...
متن کاملInput Selection and Regression using the SOM
This paper presents a global methodology to build a nonlinear regression when the number of available samples is small compared to the number of inputs. The task is divided in two parts: selection of the best inputs and construction of the approximator. A first SOM is used to compute clean correlations between the inputs and the output. A second SOM is built to link the output to the selected i...
متن کاملAn Improved Correlation Measure-based SOM Clustering Algorithm for Gene Selection
Among the large amount of genes presented in microarray gene expression data, only a small fraction of them is effective for performing a certain diagnostic test. For this reason, reducing the dimensionality of gene expression data is imperative. Self-organizing map (SOM) is a type of mathematical cluster analysis which particularly well suited for recognizing and classifying features in comple...
متن کاملImproved SOM Learning Using Simulated Annealing
Self-Organizing Map (SOM) algorithm has been extensively used for analysis and classification problems. For this kind of problems, datasets become more and more large and it is necessary to speed up the SOM learning. In this paper we present an application of the Simulated Annealing (SA) procedure to the SOM learning algorithm. The goal of the algorithm is to obtain fast learning and better per...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistics, Optimization & Information Computing
سال: 2019
ISSN: 2310-5070,2311-004X
DOI: 10.19139/soic.v7i2.561